Markov Chain Monte Carlo and Related Topics
نویسنده
چکیده
This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expansion, dynamic weighting, and multigrid Monte Carlo with its generalizations. Other related topics are the simulated annealing, the reversible jump method, and the multiple-try Metropolis rule. Theoretical issues such as bounding the mixing rate, diagnosing convergence, and conducting perfect simulations are only brieey mentioned.
منابع مشابه
Surface Patch Modeling and Perfect Simulation in Markov Random Fields
The paper discusses various issues related to the application of Gibbs models in image analysis tasks. The topics include stereo modeling for partial surface reconstruction, relations to cost function design in Bayesian imaging and computation of functions defined in terms of the proposed models by means of Markov Chain Monte Carlo Simulation. In particular we study a recently introduced techni...
متن کاملBayesian Restoration of Digital Images Employing Markov Chain Monte Carlo a Review
A review of Bayesian restoration of digital images based on Monte Carlo techniques is presented. The topics covered include Likelihood, Prior and Posterior distributions, Poisson, Binary symmetric channel and Gaussian channel models of Likelihood distribution, Ising and Potts spin models of Prior distribution, restoration of an image through Posterior maximization, statistical estimation of a t...
متن کاملA Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind
In the present work, a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind. The solution of the integral equation is described by the Neumann series expansion. Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method. An algorithm is proposed to sim...
متن کاملAlgorithms for Dynamical Fermions
This is the write-up of three lectures on algorithms for dynamical fermions that were given at the ILFTN workshop ‘Perspectives in Lattice QCD’ in Nara during November 2005. The first lecture is on the fundamentals of Markov Chain Monte Carlo methods and introduces the Hybrid Monte Carlo (HMC) algorithm and symplectic integrators; the second lecture covers topics in approximation theory and the...
متن کامل